Bus Driver Duty Optimization by Combining Constraint Programming and Linear Programming.
نویسنده
چکیده
This paper provides details of a successful application where the Column Generation Algorithm was used to combine Constraint Programming and Linear Programming. In the past, Constraint Programming and Linear Programming were considered to be two competing technologies that solved similar types of problems. Both these technologies had their strengths and weakness’. This paper shows that the two technologies can be combined together to extract the strengths of both these technologies. Details of a real –world application to optimize bus driver duties is given here. This system was developed by ILOG for a major software house in Japan using ILOG-Solver and ILOG-CPLEX, constraint programming and linear programming C/C++ libraries.
منابع مشابه
A Model for Bus Crew Scheduling Problem with Multiple Duty Types
This paper presents an approach for solving the bus crew scheduling problem which considers early, day, and late duty modes with time shift and work intensity constraints. Furthermore, the constraint with the least crew number of a certain duty e.g., day duty has also been considered. An optimization model is formulated as a 0-1 integer programming problem to improve the efficiency of crew sche...
متن کاملA Multi-objective Transmission Expansion Planning Strategy: A Bilevel Programming Method
This paper describes a methodology for transmission expansion planning (TEP) within a deregulated electricity market. Two objective functions including investment cost (IC) and congestion cost (CC) are considered. The proposed model forms a bi-level optimization problem in which upper level problem represents an independent system operator (ISO) making its decisions on investment while in the l...
متن کاملBus Driver Scheduling Problem using TLBO and JAYA Algorithm
Bus driver scheduling problem is one of most important and complex problem faced by many companies and bus terminals. This paper attempts to solve this problem using paramterless evolutionary algorithms, TLBO and JAYA algorithm. The objective of this paper is to assign the drivers to duty on a particular day and block duty by satisfying the constraints. Algorithms are tested on four randomly ge...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملA Continuous Optimization Model for Partial Digest Problem
The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000